Limiting Behavior of High Order Correlations for Simple Random Sampling
نویسندگان
چکیده
منابع مشابه
The splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملA New Exponential Type Estimator for the Population Mean in Simple Random Sampling
In this paper, a new estimate of exponential type of auxiliary information to help simple random sampling without replacement of the finite population mean is introduced. This new estimator with a few other estimates using two real data sets are compared with the mean square error.
متن کاملScalable Simple Random Sampling and Stratified Sampling
Analyzing data sets of billions of records has now become a regular task in many companies and institutions. In the statistical analysis of those massive data sets, sampling generally plays a very important role. In this work, we describe a scalable simple random sampling algorithm, named ScaSRS, which uses probabilistic thresholds to decide on the fly whether to accept, reject, or wait-list an...
متن کامل(A Bayesian Sampling Algorithm for Evolving Random Hypergraph Models Representing Higher-Order Correlations)
A number of estimation of distribution algorithms have been proposed that do not use explicitly crossover and mutation of traditional genetic algorithms, but estimate the distribution of population for more efficient search. But because it is not easy to discover higher-order correlations of variables, lower-order correlations are estimated most cases under various constraints. In this paper, w...
متن کاملLimiting behavior for the distance of a random walk
In this paper we study some aspects of the behavior of random walks on large but finite graphs before they have reached their equilibrium distribution. This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time n/2. Here, we stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2013
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-013-0217-2